ALLSAT compressed with wildcards. Part 1: Converting CNF's to orthogonal DNF's
نویسنده
چکیده
For most branching algorithms in Boolean logic “branching” means “variable-wise branching”. We present the apparently novel technique of clause-wise branching, which is used to solve the ALLSAT problem for arbitrary Boolean functions in CNF format. Specifically, it converts a CNF into an orthogonal DNF, i.e. into an exclusive sum of products. Our method is enhanced by two ingredients: The use of a good SAT-solver and wildcards beyond the common don’t-care symbol.
منابع مشابه
ALLSAT compressed with wildcards. Part 2: All k-models of a BDD
Throughout φ : {0, 1}n → {0, 1} denotes a Boolean function. In Section 2 we review the standard methods for calculating the cardinality of the model set Mod(φ) from a BDD of φ, respectively for enumerating (= generating) the whole of Mod(φ) in compressed form. Here “compressed” means using the don’t-care symbol “2” which e.g. in (1, 1, 2, 0, 1) signifies that both bitstrings (1, 1, 0, 0, 1) and...
متن کاملALLSAT compressed with wildcards. Part 4: An invitation for C-programmers
The model set of a general Boolean function in CNF is calculated in a compressed format, using wildcards. This novel method can be explained in very visual ways. Preliminary comparison with existing methods (BDD’s and ESOPs) looks promising but our algorithm begs for a C encoding which would render it comparable in more systematic ways.
متن کاملConnection and Dispersion of Computation
In this paper, we describe the impact on the computational complexity of Connection and Dispersion of CNF. In previous paper [1], we told about structural differences in the P-complete problems and NP-complete problems. In this paper, we clarify the CNF's dispersion and HornCNF's connection, and shows the difference between CNFSAT HornSAT. First we focus on the MUC decision problem. We clarify ...
متن کاملSuccincter Text Indexing with Wildcards
We study the problem of indexing text with wildcard positions, motivated by the challenge of aligning sequencing data to large genomes that contain millions of single nucleotide polymorphisms (SNPs)—positions known to differ between individuals. SNPs modeled as wildcards can lead to more informed and biologically relevant alignments. We improve the space complexity of previous approaches by giv...
متن کاملCompressed Text Indexing with Wildcards
Let T = T1φ 1T2φ k2 · · ·φdTd+1 be a text of total length n, where characters of each Ti are chosen from an alphabet Σ of size σ, and φ denotes a wildcard symbol. The text indexing with wildcards problem is to index T such that when we are given a query pattern P , we can locate the occurrences of P in T efficiently. This problem has been applied in indexing genomic sequences that contain singl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1608.08472 شماره
صفحات -
تاریخ انتشار 2016